Conjunctive Choice Logic
نویسندگان
چکیده
Handling preferences in presence of constraints is an important concept in many applications. The main purpose of this paper is to provide a new non-classical logic for representing and reasoning with preferences and functional constraints in uncertain environments. This logic, called Conjunctive Choice Logic (CCL), aims to determine feasible solutions in such environments and evaluate their satisfaction degrees. Our logic extends the propositional logic with a new logical connective called ordered conjunction. This operator, viewed as a kind of prioritized conjunction, is used when there are preferences and constraints between pieces of information.
منابع مشابه
Mutually Exclusive Modules in Logic Programming
Logic programming has traditionally lacked devices for expressing mutually exclusive modules. We address this limitation by adopting choice-conjunctive modules of the form D0&D1 where D0, D1 are a conjunction of Horn clauses and & is a linear logic connective. Solving a goal G using D0&D1 – ex(D0&D1, G) – has the following operational semantics: choose a successful one between ex(D0, G) and ex(...
متن کاملMutually Exclusive Rules in LogicWeb
LogicWeb has traditionally lacked devices for expressing mutually exclusive clauses. We address this limitation by adopting choice-conjunctive clauses of the form D0&D1 where D0,D1 are Horn clauses and & is a linear logic connective. Solving a goal G using D0&D1 – pv(D0&D1, G) – has the following operational semantics: choose a successful one between pv(D0, G) and pv(D1, G). In other words, if ...
متن کاملWhy Even the Logic of Re-Defined Choice May Still Contradict the Logic of Care in Public Health Systems?
متن کامل
Consistent Answers of Conjunctive Queries on Graphs
During the past decade, there has been an extensive investigation of the computational complexity of the consistent answers of Boolean conjunctive queries under primary key constraints. Much of this investigation has focused on self-join-free Boolean conjunctive queries. In this paper, we study the consistent answers of Boolean conjunctive queries involving a single binary relation, i.e., we co...
متن کاملEfficient homomorphism-free enumeration of conjunctive queries
Many algorithms in the field of inductive logic programming rely on a refinement operator satisfying certain desirable properties. Unfortunately, for the space of conjunctive queries under θ-subsumption, no optimal refinement operator exists. In this paper, we argue that this does not imply that frequent pattern mining in this setting can not be efficient. As an example, we consider the problem...
متن کامل